Description: 了解了操作系统中各种资源分配算法的实现,特别是对虚拟存储,页面置换有了深入的了解,并能够用高级语言进行模拟演示。在这短短的两周时间里，通过浏览、阅读有关的资料，学到了很多东西，同时也发现仅仅书本的知识是远远不够的，需要把知识运用到实践中去，能力才能得到提高。有如下几点体会：-understanding of the various operating system resource allocation algorithm implementation, in particular the virtual storage, pages replacement gained deeper understanding, and high-level language can be used for simulation. In this short period of two weeks time, through a browser, read the information and learn a lot of things, also found only book knowledge is not enough, the need to apply knowledge to practice, capacity can be improved. Some experiences are as follows : Platform: |
Size: 1870139 |
Author:周剪 |
Hits:
Description: 本游戏共几个类，其中包括从codeguru上下载的两个类CCreditStatic和CHyperLink。我自己编的代码主要放在CSuperColumnDlg.cpp文件中，共3000行左右，大家看我的代码可能觉得长了一点，说实在的，我自己也觉得长了一点，这主要是因为我编这个程序的时间太零碎，今天编一段，明天再编一段（我现在很想从头再来）。另外一方面程序要做得完美一些，有些地方真不能删。比如说，画液晶状字体，若以普通字体显示，可删去300行左右的代码，但效果就差多了。
-the game were several categories, codeguru including downloaded from the two categories CCreditStatic and CHyper Link. I addendum to the code mainly on CSuperColumnDlg.cpp document, A total of around 3,000 firms, we look at my code may feel a little longer, indeed, I think a little longer. This is mainly because I have prepared this process is too fragmented, a series today. re-allocation for tomorrow (I would like going back to square one now). The other procedures done to perfect some, in some places, not really deleted. For instance, the painting-like character LCD and ordinary fonts, deletes 300 firms around the code, but the results will be poor more. Platform: |
Size: 606130 |
Author:fasfsf |
Hits:
Description: This set of simulation files performs a computational complexity performance comparison of the two methods mentioned in the paper. The source is ANSI-C compliant, hence any C-compiler can be used to compile the source code. It has been tested using Visual Studio.net C++ and TI code composer studio C compiler for the TMS320C6701. Note that the performance comparison may be different for different platforms.-This set of simulation files performs a com putational complexity performance compariso n of the two methods mentioned in the paper. The s ource is ANSI-C compliant. hence any C-compiler can be used to compile the s ource code. It has been tested using Visual Stud io.net C and TI code composer studio C compiler f or the TMS320C6701. Note that the performance c omparison may be different for different platf orms. Platform: |
Size: 593301 |
Author:马文 |
Hits:
Description: 里面装有 5 个小程序，分别是：0-1背包问题、二叉树遍历、链式表的实现、迷宫路径、资源最优配置算法。每个程序都有详细的说明，是我这两个学期所做的实验的一部分。-containing five small programs, namely : 0-2-1 knapsack problem, the binary tree traversal and the chain table and that the realization of the maze path, the optimal resource allocation algorithm. Every procedure is described in detail in, I was doing it two semesters of part of the experiment. Platform: |
Size: 86163 |
Author:葛兴高 |
Hits:
Description: 资源分配问题,n个车间,m台设备,如何分配才能使获最大利益?-resource allocation problem, workshops n, m machines, and the distribution can be best interests Platform: |
Size: 484916 |
Author:杨小娜 |
Hits:
Description: 微软亚洲研究院论文：无线网络视频传输中功耗最低的资源分配策略-Microsoft Asia Research Institute paper : wireless network video transmission power of the minimum resource allocation strategies Platform: |
Size: 367616 |
Author:站长 |
Hits:
Description: 资源分配问题,n个车间,m台设备,如何分配才能使获最大利益?-resource allocation problem, workshops n, m machines, and the distribution can be best interests Platform: |
Size: 1735680 |
Author:杨小娜 |
Hits:
Description: 一、实验目的：
熟悉银行家算法，理解系统产生死锁的原因及避免死锁的方法,加深记意。
二、实验要求：
用高级语言编写和调试一个描述银行家算法的程序。
三、实验内容：
1、 设计一个结构体，用于描述每个进程对资源的要求分配情况。包括：进程名——name[5]，要求资源数目——command[m]（m类资源），还需要资源数目——need[m]，已分配资源数目——allo[m]。
2、 编写三个算法，分别用以完成：①申请资源；
②显示资源；③释放资源。（动态完成）-an experimental purposes : bankers familiar with the algorithm generated Deadlock understand the reasons and ways to avoid deadlock deepened memory. Two experimental requirements : high-level language writing and debugging an algorithm bankers described the procedure. 3, experiment : one, design a structure, which is used to describe each process of resource allocation of the request. Including : process name-- name [5], the number of requests for resources-- command [m] (m category resources), the number of required resources-- need [m], resources have been allocated number-- allo [m]. 2, the preparation of three algorithms, which were completed : for resources; indicated resources; freeing resources. (Dynamically) Platform: |
Size: 24576 |
Author:陈晨 |
Hits:
Description: 程序运行时，首先提示“请输入资源分配表文件的文件名：”；再提示“请输入进程等待表文件的文件名：”。
输入两个文件名后，程序将读入两个文件中的有关数据，并按照死锁检测算法进行检测。-running, first suggested "Please enter resource allocation table file name in the paper :"; another suggested "Please wait for the process to import files Table Name :." The two documents were imported, the program will read the two documents related data and in accordance with the deadlock detection algorithm for detection. Platform: |
Size: 2048 |
Author:王国强 |
Hits:
Description: 了解了操作系统中各种资源分配算法的实现,特别是对虚拟存储,页面置换有了深入的了解,并能够用高级语言进行模拟演示。在这短短的两周时间里，通过浏览、阅读有关的资料，学到了很多东西，同时也发现仅仅书本的知识是远远不够的，需要把知识运用到实践中去，能力才能得到提高。有如下几点体会：-understanding of the various operating system resource allocation algorithm implementation, in particular the virtual storage, pages replacement gained deeper understanding, and high-level language can be used for simulation. In this short period of two weeks time, through a browser, read the information and learn a lot of things, also found only book knowledge is not enough, the need to apply knowledge to practice, capacity can be improved. Some experiences are as follows : Platform: |
Size: 1869824 |
Author:周剪 |
Hits:
Description: 本游戏共几个类，其中包括从codeguru上下载的两个类CCreditStatic和CHyperLink。我自己编的代码主要放在CSuperColumnDlg.cpp文件中，共3000行左右，大家看我的代码可能觉得长了一点，说实在的，我自己也觉得长了一点，这主要是因为我编这个程序的时间太零碎，今天编一段，明天再编一段（我现在很想从头再来）。另外一方面程序要做得完美一些，有些地方真不能删。比如说，画液晶状字体，若以普通字体显示，可删去300行左右的代码，但效果就差多了。
-the game were several categories, codeguru including downloaded from the two categories CCreditStatic and CHyper Link. I addendum to the code mainly on CSuperColumnDlg.cpp document, A total of around 3,000 firms, we look at my code may feel a little longer, indeed, I think a little longer. This is mainly because I have prepared this process is too fragmented, a series today. re-allocation for tomorrow (I would like going back to square one now). The other procedures done to perfect some, in some places, not really deleted. For instance, the painting-like character LCD and ordinary fonts, deletes 300 firms around the code, but the results will be poor more. Platform: |
Size: 606208 |
Author:fasfsf |
Hits:
Search - resource allocation